/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:33:55,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:33:55,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:33:55,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:33:55,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:33:55,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:33:55,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:33:55,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:33:55,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:33:55,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:33:55,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:33:55,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:33:55,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:33:55,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:33:55,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:33:55,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:33:55,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:33:55,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:33:55,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:33:55,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:33:55,980 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:33:55,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:33:55,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:33:55,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:33:55,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:33:55,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:33:55,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:33:55,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:33:55,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:33:55,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:33:55,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:33:55,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:33:55,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:33:55,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:33:55,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:33:55,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:33:55,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:33:55,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:33:55,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:33:55,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:33:55,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:33:55,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:33:55,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:33:56,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:33:56,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:33:56,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:33:56,006 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:33:56,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:33:56,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:33:56,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:33:56,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:33:56,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:33:56,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:33:56,007 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:33:56,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:33:56,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:33:56,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:33:56,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:33:56,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:33:56,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:33:56,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:33:56,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:33:56,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:33:56,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:33:56,009 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:33:56,009 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 19:33:56,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:33:56,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:33:56,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:33:56,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:33:56,223 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:33:56,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c [2022-04-07 19:33:56,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426a0b132/80d8e2951efe41d2b3b7574b9156c476/FLAG7a81e2365 [2022-04-07 19:33:56,627 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:33:56,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c [2022-04-07 19:33:56,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426a0b132/80d8e2951efe41d2b3b7574b9156c476/FLAG7a81e2365 [2022-04-07 19:33:56,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426a0b132/80d8e2951efe41d2b3b7574b9156c476 [2022-04-07 19:33:56,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:33:56,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:33:56,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:33:56,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:33:56,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:33:56,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d0c2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56, skipping insertion in model container [2022-04-07 19:33:56,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:33:56,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:33:56,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c[709,722] [2022-04-07 19:33:56,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:33:56,851 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:33:56,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c[709,722] [2022-04-07 19:33:56,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:33:56,872 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:33:56,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56 WrapperNode [2022-04-07 19:33:56,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:33:56,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:33:56,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:33:56,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:33:56,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:33:56,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:33:56,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:33:56,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:33:56,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (1/1) ... [2022-04-07 19:33:56,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:33:56,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:33:56,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 19:33:56,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 19:33:56,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:33:56,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:33:56,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:33:56,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:33:56,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:33:56,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:33:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:33:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:33:56,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:33:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:33:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:33:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:33:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:33:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:33:57,026 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:33:57,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:33:57,112 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:33:57,117 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:33:57,117 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 19:33:57,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:33:57 BoogieIcfgContainer [2022-04-07 19:33:57,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:33:57,119 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:33:57,119 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:33:57,120 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:33:57,135 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:33:57" (1/1) ... [2022-04-07 19:33:57,136 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:33:57,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:33:57 BasicIcfg [2022-04-07 19:33:57,165 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:33:57,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:33:57,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:33:57,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:33:57,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:33:56" (1/4) ... [2022-04-07 19:33:57,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665fa1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:33:57, skipping insertion in model container [2022-04-07 19:33:57,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:56" (2/4) ... [2022-04-07 19:33:57,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665fa1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:33:57, skipping insertion in model container [2022-04-07 19:33:57,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:33:57" (3/4) ... [2022-04-07 19:33:57,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665fa1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:33:57, skipping insertion in model container [2022-04-07 19:33:57,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:33:57" (4/4) ... [2022-04-07 19:33:57,183 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2_unwindbound5.cJordan [2022-04-07 19:33:57,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:33:57,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:33:57,229 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:33:57,234 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 19:33:57,234 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:33:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:33:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 19:33:57,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:33:57,252 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:33:57,253 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:33:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:33:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1238828824, now seen corresponding path program 1 times [2022-04-07 19:33:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:33:57,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497755139] [2022-04-07 19:33:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:33:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:33:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:57,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-07 19:33:57,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 19:33:57,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 19:33:57,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:33:57,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-07 19:33:57,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 19:33:57,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 19:33:57,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 19:33:57,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [73] mainENTRY-->L33-3: Formula: (and (= v_main_~a~0_1 v_main_~x~0_1) (= v_main_~a~0_1 |v_main_#t~nondet4_2|) (= v_main_~r~0_3 1) (= v_main_~s~0_1 (/ 13.0 4.0))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~s~0, main_~a~0] {29#true} is VALID [2022-04-07 19:33:57,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [75] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 19:33:57,429 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} [77] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_~convertDOUBLEToINT_13 (* (- 1) (* v_main_~r~0_12 (* v_main_~r~0_12 12)))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[v_~convertDOUBLEToINT_13] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {30#false} is VALID [2022-04-07 19:33:57,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} [81] __VERIFIER_assertENTRY-->L17: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-07 19:33:57,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [84] L17-->L18: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 19:33:57,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [88] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 19:33:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:33:57,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:33:57,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497755139] [2022-04-07 19:33:57,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497755139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:33:57,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:33:57,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:33:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677801845] [2022-04-07 19:33:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:33:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 19:33:57,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:33:57,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:57,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:57,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:33:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:33:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:33:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:33:57,486 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:57,621 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-07 19:33:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:33:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 19:33:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:33:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 19:33:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 19:33:57,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-07 19:33:57,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:57,681 INFO L225 Difference]: With dead ends: 27 [2022-04-07 19:33:57,682 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 19:33:57,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:33:57,686 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:33:57,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:33:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 19:33:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-07 19:33:57,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:33:57,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:57,710 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:57,711 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:57,718 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-07 19:33:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 19:33:57,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:57,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:57,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-07 19:33:57,720 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-07 19:33:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:57,723 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-07 19:33:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 19:33:57,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:57,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:57,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:33:57,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:33:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-07 19:33:57,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-07 19:33:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:33:57,728 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-07 19:33:57,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 19:33:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 19:33:57,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:33:57,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:33:57,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:33:57,736 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:33:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:33:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash -221581531, now seen corresponding path program 1 times [2022-04-07 19:33:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:33:57,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664745392] [2022-04-07 19:33:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:33:57,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:33:57,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518057287] [2022-04-07 19:33:57,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:57,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:33:57,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:33:57,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:33:57,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 19:33:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:57,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:33:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:57,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:33:57,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-07 19:33:57,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {137#(<= ~counter~0 0)} is VALID [2022-04-07 19:33:57,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#(<= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {137#(<= ~counter~0 0)} is VALID [2022-04-07 19:33:57,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137#(<= ~counter~0 0)} {129#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {137#(<= ~counter~0 0)} is VALID [2022-04-07 19:33:57,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {137#(<= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {137#(<= ~counter~0 0)} is VALID [2022-04-07 19:33:57,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#(<= ~counter~0 0)} [73] mainENTRY-->L33-3: Formula: (and (= v_main_~a~0_1 v_main_~x~0_1) (= v_main_~a~0_1 |v_main_#t~nondet4_2|) (= v_main_~r~0_3 1) (= v_main_~s~0_1 (/ 13.0 4.0))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~s~0, main_~a~0] {137#(<= ~counter~0 0)} is VALID [2022-04-07 19:33:57,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#(<= ~counter~0 0)} [76] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {153#(<= |main_#t~post5| 0)} is VALID [2022-04-07 19:33:57,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#(<= |main_#t~post5| 0)} [78] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {130#false} is VALID [2022-04-07 19:33:57,936 INFO L272 TraceCheckUtils]: 8: Hoare triple {130#false} [77] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_~convertDOUBLEToINT_13 (* (- 1) (* v_main_~r~0_12 (* v_main_~r~0_12 12)))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[v_~convertDOUBLEToINT_13] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {130#false} is VALID [2022-04-07 19:33:57,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} [81] __VERIFIER_assertENTRY-->L17: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#false} is VALID [2022-04-07 19:33:57,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#false} [84] L17-->L18: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 19:33:57,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#false} [88] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 19:33:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:33:57,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:33:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:33:57,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664745392] [2022-04-07 19:33:57,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:33:57,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518057287] [2022-04-07 19:33:57,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518057287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:33:57,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:33:57,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:33:57,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650510351] [2022-04-07 19:33:57,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:33:57,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:33:57,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:33:57,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:57,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:57,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 19:33:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:33:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 19:33:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:33:57,949 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:58,006 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 19:33:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 19:33:58,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:33:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:33:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 19:33:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 19:33:58,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-07 19:33:58,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:58,029 INFO L225 Difference]: With dead ends: 23 [2022-04-07 19:33:58,029 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 19:33:58,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:33:58,031 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:33:58,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:33:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 19:33:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-07 19:33:58,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:33:58,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:58,034 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:58,034 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:58,036 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 19:33:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 19:33:58,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:58,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:58,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-07 19:33:58,037 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-07 19:33:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:58,039 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 19:33:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 19:33:58,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:58,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:58,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:33:58,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:33:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:33:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-07 19:33:58,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-07 19:33:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:33:58,060 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-07 19:33:58,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 19:33:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 19:33:58,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:33:58,063 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:33:58,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 19:33:58,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:33:58,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:33:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:33:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -220509055, now seen corresponding path program 1 times [2022-04-07 19:33:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:33:58,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064316117] [2022-04-07 19:33:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:33:58,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:33:58,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439351311] [2022-04-07 19:33:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:58,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:33:58,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:33:58,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:33:58,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 19:33:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:33:58,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:33:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:33:58,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:33:58,352 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:33:58,352 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:33:58,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 19:33:58,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 19:33:58,572 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 19:33:58,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:33:58,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:33:58 BasicIcfg [2022-04-07 19:33:58,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:33:58,588 INFO L158 Benchmark]: Toolchain (without parser) took 1940.68ms. Allocated memory was 199.2MB in the beginning and 253.8MB in the end (delta: 54.5MB). Free memory was 148.4MB in the beginning and 221.6MB in the end (delta: -73.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:33:58,588 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory was 165.0MB in the beginning and 164.8MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:33:58,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.04ms. Allocated memory is still 199.2MB. Free memory was 148.2MB in the beginning and 173.9MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 19:33:58,589 INFO L158 Benchmark]: Boogie Preprocessor took 43.89ms. Allocated memory is still 199.2MB. Free memory was 173.9MB in the beginning and 172.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:33:58,589 INFO L158 Benchmark]: RCFGBuilder took 200.56ms. Allocated memory is still 199.2MB. Free memory was 171.8MB in the beginning and 160.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 19:33:58,589 INFO L158 Benchmark]: IcfgTransformer took 46.18ms. Allocated memory is still 199.2MB. Free memory was 160.7MB in the beginning and 159.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 19:33:58,590 INFO L158 Benchmark]: TraceAbstraction took 1421.13ms. Allocated memory was 199.2MB in the beginning and 253.8MB in the end (delta: 54.5MB). Free memory was 158.6MB in the beginning and 221.6MB in the end (delta: -63.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:33:58,591 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory was 165.0MB in the beginning and 164.8MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.04ms. Allocated memory is still 199.2MB. Free memory was 148.2MB in the beginning and 173.9MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.89ms. Allocated memory is still 199.2MB. Free memory was 173.9MB in the beginning and 172.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 200.56ms. Allocated memory is still 199.2MB. Free memory was 171.8MB in the beginning and 160.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 46.18ms. Allocated memory is still 199.2MB. Free memory was 160.7MB in the beginning and 159.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1421.13ms. Allocated memory was 199.2MB in the beginning and 253.8MB in the end (delta: 54.5MB). Free memory was 158.6MB in the beginning and 221.6MB in the end (delta: -63.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 34. Possible FailurePath: [L24] int counter = 0; VAL [\old(counter)=6, counter=0] [L26] int r; [L27] double a, x, s; [L28] a = __VERIFIER_nondet_double() [L29] x = a [L30] s = 3.25 [L31] r = 1 VAL [\old(counter)=0, a=2, counter=0, r=1, s=13/4, x=2] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=1, counter++=0, r=1, s=13/4, x=2] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert((int)(4*s) - 12*r*r == 1) VAL [\old(cond)=0, \old(counter)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 56 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 1 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-07 19:33:58,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...