./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:54,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:54,733 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:38:54,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:54,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:54,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:54,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:54,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:54,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:54,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:54,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:54,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:54,788 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:54,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:54,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:54,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:38:54,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:54,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:54,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:54,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:54,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:54,793 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:54,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:54,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:54,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:54,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:54,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:54,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:54,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:54,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:38:54,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:38:54,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:54,799 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:54,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:54,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:54,800 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:54,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2023-11-19 07:38:55,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:55,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:55,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:55,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:55,161 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:55,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-19 07:38:58,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:58,623 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:58,623 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-19 07:38:58,638 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data/d471f8ab0/24c97041a9b34c7cae7aeebd457b7b44/FLAGdb9f4d08c [2023-11-19 07:38:58,664 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data/d471f8ab0/24c97041a9b34c7cae7aeebd457b7b44 [2023-11-19 07:38:58,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:58,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:58,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:58,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:58,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:58,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:58" (1/1) ... [2023-11-19 07:38:58,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e14c50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:58, skipping insertion in model container [2023-11-19 07:38:58,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:58" (1/1) ... [2023-11-19 07:38:58,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:58,907 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-19 07:38:59,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:59,122 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:59,132 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-19 07:38:59,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:59,250 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:59,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59 WrapperNode [2023-11-19 07:38:59,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:59,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:59,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:59,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:59,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,597 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1873 [2023-11-19 07:38:59,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:59,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:59,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:59,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:59,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:59,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:59,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:59,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:59,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (1/1) ... [2023-11-19 07:38:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:59,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:59,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:38:59,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:38:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:38:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:59,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:00,219 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:00,222 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:02,321 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:02,345 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:02,345 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:39:02,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:02 BoogieIcfgContainer [2023-11-19 07:39:02,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:02,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:02,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:02,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:02,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:58" (1/3) ... [2023-11-19 07:39:02,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bebe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:02, skipping insertion in model container [2023-11-19 07:39:02,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:59" (2/3) ... [2023-11-19 07:39:02,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bebe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:02, skipping insertion in model container [2023-11-19 07:39:02,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:02" (3/3) ... [2023-11-19 07:39:02,371 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-19 07:39:02,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:02,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:39:02,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:02,485 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f1c17a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:02,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:39:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 451 states, 449 states have (on average 1.6681514476614698) internal successors, (749), 450 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-19 07:39:02,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:02,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:02,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:02,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash -605321278, now seen corresponding path program 1 times [2023-11-19 07:39:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:02,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647673082] [2023-11-19 07:39:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:03,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:03,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647673082] [2023-11-19 07:39:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647673082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:03,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279590417] [2023-11-19 07:39:03,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:03,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:03,279 INFO L87 Difference]: Start difference. First operand has 451 states, 449 states have (on average 1.6681514476614698) internal successors, (749), 450 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:03,423 INFO L93 Difference]: Finished difference Result 885 states and 1476 transitions. [2023-11-19 07:39:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-19 07:39:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:03,443 INFO L225 Difference]: With dead ends: 885 [2023-11-19 07:39:03,443 INFO L226 Difference]: Without dead ends: 466 [2023-11-19 07:39:03,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:03,452 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 1397 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:03,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 848 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-11-19 07:39:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 447. [2023-11-19 07:39:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.663677130044843) internal successors, (742), 446 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 742 transitions. [2023-11-19 07:39:03,549 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 742 transitions. Word has length 59 [2023-11-19 07:39:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:03,551 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 742 transitions. [2023-11-19 07:39:03,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 742 transitions. [2023-11-19 07:39:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-19 07:39:03,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:03,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:03,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:03,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:03,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1917691606, now seen corresponding path program 1 times [2023-11-19 07:39:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103929622] [2023-11-19 07:39:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:03,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:03,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103929622] [2023-11-19 07:39:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103929622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:03,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654621954] [2023-11-19 07:39:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:03,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:03,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:03,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:03,924 INFO L87 Difference]: Start difference. First operand 447 states and 742 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:03,998 INFO L93 Difference]: Finished difference Result 451 states and 746 transitions. [2023-11-19 07:39:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-19 07:39:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:04,002 INFO L225 Difference]: With dead ends: 451 [2023-11-19 07:39:04,003 INFO L226 Difference]: Without dead ends: 449 [2023-11-19 07:39:04,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:04,005 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 1 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:04,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2214 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-19 07:39:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2023-11-19 07:39:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6607142857142858) internal successors, (744), 448 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 744 transitions. [2023-11-19 07:39:04,021 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 744 transitions. Word has length 60 [2023-11-19 07:39:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:04,022 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 744 transitions. [2023-11-19 07:39:04,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 744 transitions. [2023-11-19 07:39:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-19 07:39:04,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:04,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:04,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:39:04,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:04,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash -679377056, now seen corresponding path program 1 times [2023-11-19 07:39:04,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:04,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701999477] [2023-11-19 07:39:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:04,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:04,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701999477] [2023-11-19 07:39:04,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701999477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:04,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:04,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:04,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94573992] [2023-11-19 07:39:04,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:04,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:04,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:04,251 INFO L87 Difference]: Start difference. First operand 449 states and 744 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:04,301 INFO L93 Difference]: Finished difference Result 869 states and 1440 transitions. [2023-11-19 07:39:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-19 07:39:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:04,308 INFO L225 Difference]: With dead ends: 869 [2023-11-19 07:39:04,308 INFO L226 Difference]: Without dead ends: 452 [2023-11-19 07:39:04,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:04,320 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 1 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:04,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-19 07:39:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 451. [2023-11-19 07:39:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.6577777777777778) internal successors, (746), 450 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 746 transitions. [2023-11-19 07:39:04,337 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 746 transitions. Word has length 61 [2023-11-19 07:39:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:04,339 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 746 transitions. [2023-11-19 07:39:04,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 746 transitions. [2023-11-19 07:39:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-19 07:39:04,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:04,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:04,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:04,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:04,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash 203715632, now seen corresponding path program 1 times [2023-11-19 07:39:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:04,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36557088] [2023-11-19 07:39:04,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36557088] [2023-11-19 07:39:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36557088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:04,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:04,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873294163] [2023-11-19 07:39:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:04,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:04,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:04,611 INFO L87 Difference]: Start difference. First operand 451 states and 746 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:04,689 INFO L93 Difference]: Finished difference Result 1279 states and 2119 transitions. [2023-11-19 07:39:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:04,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-11-19 07:39:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:04,699 INFO L225 Difference]: With dead ends: 1279 [2023-11-19 07:39:04,700 INFO L226 Difference]: Without dead ends: 860 [2023-11-19 07:39:04,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:04,705 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 676 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:04,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2369 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-19 07:39:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 453. [2023-11-19 07:39:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.654867256637168) internal successors, (748), 452 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 748 transitions. [2023-11-19 07:39:04,723 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 748 transitions. Word has length 62 [2023-11-19 07:39:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:04,724 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 748 transitions. [2023-11-19 07:39:04,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 748 transitions. [2023-11-19 07:39:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-19 07:39:04,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:04,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:04,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:39:04,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:04,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash -674842874, now seen corresponding path program 1 times [2023-11-19 07:39:04,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669209826] [2023-11-19 07:39:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669209826] [2023-11-19 07:39:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669209826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:05,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:05,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051058608] [2023-11-19 07:39:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:05,391 INFO L87 Difference]: Start difference. First operand 453 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:05,606 INFO L93 Difference]: Finished difference Result 1289 states and 2131 transitions. [2023-11-19 07:39:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-11-19 07:39:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:05,614 INFO L225 Difference]: With dead ends: 1289 [2023-11-19 07:39:05,615 INFO L226 Difference]: Without dead ends: 868 [2023-11-19 07:39:05,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:39:05,617 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 2648 mSDsluCounter, 3093 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:05,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 3912 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2023-11-19 07:39:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 456. [2023-11-19 07:39:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.6549450549450548) internal successors, (753), 455 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 753 transitions. [2023-11-19 07:39:05,638 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 753 transitions. Word has length 63 [2023-11-19 07:39:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:05,639 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 753 transitions. [2023-11-19 07:39:05,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 753 transitions. [2023-11-19 07:39:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-19 07:39:05,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:05,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:05,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:39:05,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:05,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:05,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2066517898, now seen corresponding path program 1 times [2023-11-19 07:39:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566141421] [2023-11-19 07:39:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:05,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566141421] [2023-11-19 07:39:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566141421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738428687] [2023-11-19 07:39:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:05,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:05,908 INFO L87 Difference]: Start difference. First operand 456 states and 753 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:06,719 INFO L93 Difference]: Finished difference Result 1304 states and 2155 transitions. [2023-11-19 07:39:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-11-19 07:39:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:06,725 INFO L225 Difference]: With dead ends: 1304 [2023-11-19 07:39:06,725 INFO L226 Difference]: Without dead ends: 880 [2023-11-19 07:39:06,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:06,727 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 2067 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:06,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 1658 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:39:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-11-19 07:39:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 510. [2023-11-19 07:39:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.6483300589390963) internal successors, (839), 509 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 839 transitions. [2023-11-19 07:39:06,747 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 839 transitions. Word has length 64 [2023-11-19 07:39:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:06,747 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 839 transitions. [2023-11-19 07:39:06,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 839 transitions. [2023-11-19 07:39:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-19 07:39:06,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:06,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:06,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:39:06,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:06,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1673490888, now seen corresponding path program 1 times [2023-11-19 07:39:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:06,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944559528] [2023-11-19 07:39:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944559528] [2023-11-19 07:39:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944559528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:39:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149227561] [2023-11-19 07:39:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:07,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:07,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:07,464 INFO L87 Difference]: Start difference. First operand 510 states and 839 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:08,121 INFO L93 Difference]: Finished difference Result 985 states and 1619 transitions. [2023-11-19 07:39:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:39:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-11-19 07:39:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:08,125 INFO L225 Difference]: With dead ends: 985 [2023-11-19 07:39:08,125 INFO L226 Difference]: Without dead ends: 558 [2023-11-19 07:39:08,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:39:08,127 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 740 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:08,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3447 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:39:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-11-19 07:39:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 522. [2023-11-19 07:39:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.6449136276391554) internal successors, (857), 521 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 857 transitions. [2023-11-19 07:39:08,144 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 857 transitions. Word has length 64 [2023-11-19 07:39:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:08,145 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 857 transitions. [2023-11-19 07:39:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 857 transitions. [2023-11-19 07:39:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-19 07:39:08,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:08,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:39:08,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:08,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1086684874, now seen corresponding path program 1 times [2023-11-19 07:39:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135435139] [2023-11-19 07:39:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135435139] [2023-11-19 07:39:08,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135435139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:08,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:08,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:39:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359348106] [2023-11-19 07:39:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:08,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:08,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:08,691 INFO L87 Difference]: Start difference. First operand 522 states and 857 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:09,046 INFO L93 Difference]: Finished difference Result 986 states and 1618 transitions. [2023-11-19 07:39:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-11-19 07:39:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:09,050 INFO L225 Difference]: With dead ends: 986 [2023-11-19 07:39:09,050 INFO L226 Difference]: Without dead ends: 544 [2023-11-19 07:39:09,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:39:09,052 INFO L413 NwaCegarLoop]: 713 mSDtfsCounter, 724 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 4226 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:09,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 4226 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:39:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2023-11-19 07:39:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 524. [2023-11-19 07:39:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.6424474187380498) internal successors, (859), 523 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 859 transitions. [2023-11-19 07:39:09,069 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 859 transitions. Word has length 64 [2023-11-19 07:39:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:09,070 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 859 transitions. [2023-11-19 07:39:09,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 859 transitions. [2023-11-19 07:39:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-19 07:39:09,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:09,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:09,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:39:09,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:09,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash -15452854, now seen corresponding path program 1 times [2023-11-19 07:39:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:09,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130018837] [2023-11-19 07:39:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:09,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130018837] [2023-11-19 07:39:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130018837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:09,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:09,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106172369] [2023-11-19 07:39:09,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:09,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:09,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:09,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:09,384 INFO L87 Difference]: Start difference. First operand 524 states and 859 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:09,522 INFO L93 Difference]: Finished difference Result 1397 states and 2289 transitions. [2023-11-19 07:39:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-11-19 07:39:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:09,528 INFO L225 Difference]: With dead ends: 1397 [2023-11-19 07:39:09,528 INFO L226 Difference]: Without dead ends: 952 [2023-11-19 07:39:09,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:09,530 INFO L413 NwaCegarLoop]: 1356 mSDtfsCounter, 1386 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:09,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 2058 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2023-11-19 07:39:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 524. [2023-11-19 07:39:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.6386233269598471) internal successors, (857), 523 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 857 transitions. [2023-11-19 07:39:09,550 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 857 transitions. Word has length 64 [2023-11-19 07:39:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:09,550 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 857 transitions. [2023-11-19 07:39:09,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 857 transitions. [2023-11-19 07:39:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-19 07:39:09,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:09,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:09,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:39:09,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:09,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1758059830, now seen corresponding path program 1 times [2023-11-19 07:39:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:09,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892002231] [2023-11-19 07:39:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892002231] [2023-11-19 07:39:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892002231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623351414] [2023-11-19 07:39:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:09,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:09,779 INFO L87 Difference]: Start difference. First operand 524 states and 857 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:09,985 INFO L93 Difference]: Finished difference Result 1775 states and 2910 transitions. [2023-11-19 07:39:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-19 07:39:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:09,993 INFO L225 Difference]: With dead ends: 1775 [2023-11-19 07:39:09,994 INFO L226 Difference]: Without dead ends: 1327 [2023-11-19 07:39:09,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:09,996 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 1266 mSDsluCounter, 4244 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:09,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 5631 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2023-11-19 07:39:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 534. [2023-11-19 07:39:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.6266416510318948) internal successors, (867), 533 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 867 transitions. [2023-11-19 07:39:10,018 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 867 transitions. Word has length 65 [2023-11-19 07:39:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:10,019 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 867 transitions. [2023-11-19 07:39:10,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 867 transitions. [2023-11-19 07:39:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-19 07:39:10,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:10,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:10,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:39:10,021 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:10,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1696185432, now seen corresponding path program 1 times [2023-11-19 07:39:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638077430] [2023-11-19 07:39:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:10,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638077430] [2023-11-19 07:39:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638077430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:10,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671198918] [2023-11-19 07:39:10,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:10,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:10,156 INFO L87 Difference]: Start difference. First operand 534 states and 867 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:10,183 INFO L93 Difference]: Finished difference Result 1013 states and 1644 transitions. [2023-11-19 07:39:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-19 07:39:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:10,187 INFO L225 Difference]: With dead ends: 1013 [2023-11-19 07:39:10,187 INFO L226 Difference]: Without dead ends: 548 [2023-11-19 07:39:10,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:10,189 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 6 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1476 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 [2023-11-19 07:39:10,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1476 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-11-19 07:39:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 536. [2023-11-19 07:39:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.6242990654205607) internal successors, (869), 535 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 869 transitions. [2023-11-19 07:39:10,206 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 869 transitions. Word has length 65 [2023-11-19 07:39:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:10,206 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 869 transitions. [2023-11-19 07:39:10,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 869 transitions. [2023-11-19 07:39:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-19 07:39:10,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:10,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:10,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:39:10,208 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:10,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash -179877851, now seen corresponding path program 1 times [2023-11-19 07:39:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036515016] [2023-11-19 07:39:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036515016] [2023-11-19 07:39:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036515016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:10,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672023295] [2023-11-19 07:39:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:10,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:10,353 INFO L87 Difference]: Start difference. First operand 536 states and 869 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:10,555 INFO L93 Difference]: Finished difference Result 1856 states and 3015 transitions. [2023-11-19 07:39:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-11-19 07:39:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:10,564 INFO L225 Difference]: With dead ends: 1856 [2023-11-19 07:39:10,565 INFO L226 Difference]: Without dead ends: 1400 [2023-11-19 07:39:10,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:10,567 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 1321 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:10,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 2905 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-11-19 07:39:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 973. [2023-11-19 07:39:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.618312757201646) internal successors, (1573), 972 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1573 transitions. [2023-11-19 07:39:10,606 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1573 transitions. Word has length 66 [2023-11-19 07:39:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:10,606 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1573 transitions. [2023-11-19 07:39:10,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1573 transitions. [2023-11-19 07:39:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-19 07:39:10,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:10,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:10,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:39:10,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:10,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 477648191, now seen corresponding path program 1 times [2023-11-19 07:39:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:10,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704607482] [2023-11-19 07:39:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:10,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704607482] [2023-11-19 07:39:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704607482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528426064] [2023-11-19 07:39:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:10,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:10,923 INFO L87 Difference]: Start difference. First operand 973 states and 1573 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:11,144 INFO L93 Difference]: Finished difference Result 2275 states and 3691 transitions. [2023-11-19 07:39:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-11-19 07:39:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:11,153 INFO L225 Difference]: With dead ends: 2275 [2023-11-19 07:39:11,153 INFO L226 Difference]: Without dead ends: 1391 [2023-11-19 07:39:11,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:11,156 INFO L413 NwaCegarLoop]: 1345 mSDtfsCounter, 2065 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:11,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 2035 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:39:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-11-19 07:39:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 973. [2023-11-19 07:39:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.6080246913580247) internal successors, (1563), 972 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1563 transitions. [2023-11-19 07:39:11,198 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1563 transitions. Word has length 66 [2023-11-19 07:39:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:11,198 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1563 transitions. [2023-11-19 07:39:11,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1563 transitions. [2023-11-19 07:39:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-19 07:39:11,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:11,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:11,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:39:11,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:11,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1051239942, now seen corresponding path program 1 times [2023-11-19 07:39:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:11,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897149601] [2023-11-19 07:39:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:11,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897149601] [2023-11-19 07:39:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897149601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:11,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:11,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106109708] [2023-11-19 07:39:11,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:11,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:11,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:11,340 INFO L87 Difference]: Start difference. First operand 973 states and 1563 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:11,374 INFO L93 Difference]: Finished difference Result 1819 states and 2933 transitions. [2023-11-19 07:39:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:11,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-19 07:39:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:11,378 INFO L225 Difference]: With dead ends: 1819 [2023-11-19 07:39:11,378 INFO L226 Difference]: Without dead ends: 534 [2023-11-19 07:39:11,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:11,382 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1468 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 [2023-11-19 07:39:11,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1468 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-19 07:39:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2023-11-19 07:39:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.6041275797373358) internal successors, (855), 533 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 855 transitions. [2023-11-19 07:39:11,404 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 855 transitions. Word has length 67 [2023-11-19 07:39:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:11,404 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 855 transitions. [2023-11-19 07:39:11,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 855 transitions. [2023-11-19 07:39:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-19 07:39:11,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:11,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:11,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:39:11,406 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:11,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash 700173342, now seen corresponding path program 1 times [2023-11-19 07:39:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:11,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689469555] [2023-11-19 07:39:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689469555] [2023-11-19 07:39:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689469555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:39:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045233217] [2023-11-19 07:39:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:11,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:39:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:11,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:39:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:11,944 INFO L87 Difference]: Start difference. First operand 534 states and 855 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:12,165 INFO L93 Difference]: Finished difference Result 987 states and 1587 transitions. [2023-11-19 07:39:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-19 07:39:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:12,169 INFO L225 Difference]: With dead ends: 987 [2023-11-19 07:39:12,169 INFO L226 Difference]: Without dead ends: 536 [2023-11-19 07:39:12,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:39:12,173 INFO L413 NwaCegarLoop]: 765 mSDtfsCounter, 1372 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:12,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 3130 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-11-19 07:39:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 530. [2023-11-19 07:39:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.6049149338374291) internal successors, (849), 529 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 849 transitions. [2023-11-19 07:39:12,191 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 849 transitions. Word has length 67 [2023-11-19 07:39:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:12,191 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 849 transitions. [2023-11-19 07:39:12,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 849 transitions. [2023-11-19 07:39:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-19 07:39:12,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:12,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:39:12,193 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:12,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -117475108, now seen corresponding path program 1 times [2023-11-19 07:39:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:12,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788306586] [2023-11-19 07:39:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788306586] [2023-11-19 07:39:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788306586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:12,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133608674] [2023-11-19 07:39:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:12,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:12,542 INFO L87 Difference]: Start difference. First operand 530 states and 849 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:12,679 INFO L93 Difference]: Finished difference Result 1015 states and 1619 transitions. [2023-11-19 07:39:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:12,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-19 07:39:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:12,683 INFO L225 Difference]: With dead ends: 1015 [2023-11-19 07:39:12,683 INFO L226 Difference]: Without dead ends: 542 [2023-11-19 07:39:12,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:12,685 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1400 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:12,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 2363 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-11-19 07:39:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 534. [2023-11-19 07:39:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.596622889305816) internal successors, (851), 533 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 851 transitions. [2023-11-19 07:39:12,703 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 851 transitions. Word has length 67 [2023-11-19 07:39:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:12,704 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 851 transitions. [2023-11-19 07:39:12,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 851 transitions. [2023-11-19 07:39:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 07:39:12,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:12,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:39:12,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:12,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1776852763, now seen corresponding path program 1 times [2023-11-19 07:39:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133446480] [2023-11-19 07:39:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133446480] [2023-11-19 07:39:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133446480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:39:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087156276] [2023-11-19 07:39:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:13,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:13,040 INFO L87 Difference]: Start difference. First operand 534 states and 851 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:13,398 INFO L93 Difference]: Finished difference Result 1847 states and 2969 transitions. [2023-11-19 07:39:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:39:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-19 07:39:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:13,406 INFO L225 Difference]: With dead ends: 1847 [2023-11-19 07:39:13,406 INFO L226 Difference]: Without dead ends: 1402 [2023-11-19 07:39:13,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:39:13,409 INFO L413 NwaCegarLoop]: 2014 mSDtfsCounter, 1406 mSDsluCounter, 10085 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 12099 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:13,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 12099 Invalid, 159 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2023-11-19 07:39:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 548. [2023-11-19 07:39:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5886654478976234) internal successors, (869), 547 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 869 transitions. [2023-11-19 07:39:13,433 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 869 transitions. Word has length 68 [2023-11-19 07:39:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:13,434 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 869 transitions. [2023-11-19 07:39:13,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 869 transitions. [2023-11-19 07:39:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 07:39:13,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:13,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:13,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:39:13,436 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:13,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 188504861, now seen corresponding path program 1 times [2023-11-19 07:39:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994691326] [2023-11-19 07:39:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994691326] [2023-11-19 07:39:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994691326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967573806] [2023-11-19 07:39:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:13,951 INFO L87 Difference]: Start difference. First operand 548 states and 869 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:14,408 INFO L93 Difference]: Finished difference Result 1429 states and 2289 transitions. [2023-11-19 07:39:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:14,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-19 07:39:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:14,415 INFO L225 Difference]: With dead ends: 1429 [2023-11-19 07:39:14,415 INFO L226 Difference]: Without dead ends: 986 [2023-11-19 07:39:14,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:39:14,417 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 2027 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5436 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:14,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5436 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:39:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2023-11-19 07:39:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 548. [2023-11-19 07:39:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5886654478976234) internal successors, (869), 547 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 869 transitions. [2023-11-19 07:39:14,445 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 869 transitions. Word has length 68 [2023-11-19 07:39:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:14,445 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 869 transitions. [2023-11-19 07:39:14,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 869 transitions. [2023-11-19 07:39:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 07:39:14,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:14,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:14,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:39:14,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:14,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -398301153, now seen corresponding path program 1 times [2023-11-19 07:39:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434280039] [2023-11-19 07:39:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:14,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:14,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434280039] [2023-11-19 07:39:14,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434280039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:14,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:14,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:14,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175293177] [2023-11-19 07:39:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:14,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:14,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:14,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:14,844 INFO L87 Difference]: Start difference. First operand 548 states and 869 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:15,040 INFO L93 Difference]: Finished difference Result 1003 states and 1600 transitions. [2023-11-19 07:39:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-19 07:39:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:15,044 INFO L225 Difference]: With dead ends: 1003 [2023-11-19 07:39:15,044 INFO L226 Difference]: Without dead ends: 534 [2023-11-19 07:39:15,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:15,046 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 1408 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:15,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 2782 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-19 07:39:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2023-11-19 07:39:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.5928705440900564) internal successors, (849), 533 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 849 transitions. [2023-11-19 07:39:15,090 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 849 transitions. Word has length 68 [2023-11-19 07:39:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:15,091 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 849 transitions. [2023-11-19 07:39:15,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 849 transitions. [2023-11-19 07:39:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 07:39:15,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:15,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:15,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:39:15,093 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:15,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash -615391585, now seen corresponding path program 1 times [2023-11-19 07:39:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388284838] [2023-11-19 07:39:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388284838] [2023-11-19 07:39:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388284838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:15,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981561235] [2023-11-19 07:39:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:15,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:15,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:15,313 INFO L87 Difference]: Start difference. First operand 534 states and 849 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:15,406 INFO L93 Difference]: Finished difference Result 991 states and 1585 transitions. [2023-11-19 07:39:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-19 07:39:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:15,411 INFO L225 Difference]: With dead ends: 991 [2023-11-19 07:39:15,411 INFO L226 Difference]: Without dead ends: 546 [2023-11-19 07:39:15,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:15,415 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 701 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:15,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1421 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-19 07:39:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 536. [2023-11-19 07:39:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.5906542056074766) internal successors, (851), 535 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 851 transitions. [2023-11-19 07:39:15,442 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 851 transitions. Word has length 68 [2023-11-19 07:39:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:15,442 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 851 transitions. [2023-11-19 07:39:15,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 851 transitions. [2023-11-19 07:39:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 07:39:15,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:15,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:15,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:39:15,445 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:15,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2091227809, now seen corresponding path program 1 times [2023-11-19 07:39:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179725341] [2023-11-19 07:39:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:15,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:39:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:15,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:39:15,644 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:39:15,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:39:15,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:39:15,652 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:15,656 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:39:15,707 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-19 07:39:15,709 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-19 07:39:15,709 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-19 07:39:15,710 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-19 07:39:15,710 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-19 07:39:15,710 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-19 07:39:15,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-19 07:39:15,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-19 07:39:15,716 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-19 07:39:15,716 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated [2023-11-19 07:39:15,717 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-19 07:39:15,717 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-19 07:39:15,718 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-19 07:39:15,718 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-19 07:39:15,724 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-19 07:39:15,725 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated [2023-11-19 07:39:15,726 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet20 could not be translated [2023-11-19 07:39:15,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated [2023-11-19 07:39:15,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-19 07:39:15,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-19 07:39:15,737 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet25 could not be translated [2023-11-19 07:39:15,740 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet27 could not be translated [2023-11-19 07:39:15,741 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-19 07:39:15,741 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-19 07:39:15,742 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-19 07:39:15,745 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet35 could not be translated [2023-11-19 07:39:15,746 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet36 could not be translated [2023-11-19 07:39:15,747 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet37 could not be translated [2023-11-19 07:39:15,748 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-19 07:39:15,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-19 07:39:15,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-19 07:39:15,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-19 07:39:15,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite41 could not be translated [2023-11-19 07:39:15,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-19 07:39:15,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-19 07:39:15,751 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet42 could not be translated [2023-11-19 07:39:15,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated [2023-11-19 07:39:15,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated [2023-11-19 07:39:15,753 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite46 could not be translated [2023-11-19 07:39:15,753 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet47 could not be translated [2023-11-19 07:39:15,754 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet48 could not be translated [2023-11-19 07:39:15,755 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet49 could not be translated [2023-11-19 07:39:15,756 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated [2023-11-19 07:39:15,756 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-19 07:39:15,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:39:15 BoogieIcfgContainer [2023-11-19 07:39:15,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:39:15,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:39:15,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:39:15,785 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:39:15,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:02" (3/4) ... [2023-11-19 07:39:15,790 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:39:15,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:39:15,793 INFO L158 Benchmark]: Toolchain (without parser) took 17124.54ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 124.9MB in the beginning and 273.9MB in the end (delta: -149.0MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,793 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:15,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.66ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 97.7MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 345.85ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 109.0MB in the end (delta: -11.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,794 INFO L158 Benchmark]: Boogie Preprocessor took 298.62ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 93.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,799 INFO L158 Benchmark]: RCFGBuilder took 2459.07ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 93.5MB in the beginning and 178.1MB in the end (delta: -84.6MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,800 INFO L158 Benchmark]: TraceAbstraction took 13424.04ms. Allocated memory was 251.7MB in the beginning and 436.2MB in the end (delta: 184.5MB). Free memory was 178.1MB in the beginning and 273.9MB in the end (delta: -95.8MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,800 INFO L158 Benchmark]: Witness Printer took 7.00ms. Allocated memory is still 436.2MB. Free memory is still 273.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:15,807 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.66ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 97.7MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 345.85ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 109.0MB in the end (delta: -11.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 298.62ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 93.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2459.07ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 93.5MB in the beginning and 178.1MB in the end (delta: -84.6MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13424.04ms. Allocated memory was 251.7MB in the beginning and 436.2MB in the end (delta: 184.5MB). Free memory was 178.1MB in the beginning and 273.9MB in the end (delta: -95.8MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 7.00ms. Allocated memory is still 436.2MB. Free memory is still 273.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 17; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 20; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=20] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=20] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=20] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=20] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR var_33_arg_0 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=255, var_5=0, var_79=20] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=255, var_5=0, var_79=20] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 451 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22613 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22613 mSDsluCounter, 63689 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44522 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2403 IncrementalHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 19167 mSDtfsCounter, 2403 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=973occurred in iteration=12, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 4659 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1364 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1276 ConstructedInterpolants, 0 QuantifiedInterpolants, 5092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 [2023-11-19 07:39:15,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:18,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:18,558 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-19 07:39:18,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:18,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:18,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:18,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:18,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:18,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:18,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:18,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:18,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:18,607 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:18,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:18,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:39:18,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:18,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:39:18,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:18,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:39:18,613 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:39:18,613 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:39:18,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:39:18,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:39:18,615 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:18,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:18,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:18,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:18,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:18,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:18,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:18,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:39:18,620 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:39:18,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:39:18,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:18,621 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:39:18,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:18,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:18,622 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:39:18,622 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:18,623 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2023-11-19 07:39:19,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:19,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:19,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:19,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:19,105 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:19,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-19 07:39:22,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:22,556 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:22,557 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-19 07:39:22,569 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data/9128ce0fd/3c415ecad78a4c779e377651bae4e045/FLAGf589f56f3 [2023-11-19 07:39:22,585 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/data/9128ce0fd/3c415ecad78a4c779e377651bae4e045 [2023-11-19 07:39:22,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:22,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:22,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:22,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:22,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:22,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:22" (1/1) ... [2023-11-19 07:39:22,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20635ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:22, skipping insertion in model container [2023-11-19 07:39:22,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:22" (1/1) ... [2023-11-19 07:39:22,645 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:22,811 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-19 07:39:22,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:22,996 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:23,010 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-19 07:39:23,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:23,165 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:23,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23 WrapperNode [2023-11-19 07:39:23,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:23,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:23,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:23,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:23,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,244 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 455 [2023-11-19 07:39:23,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:23,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:23,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:23,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:23,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:23,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:23,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:23,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:23,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (1/1) ... [2023-11-19 07:39:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:23,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:39:23,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:39:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:39:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:23,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:23,627 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:23,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:24,497 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:24,506 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:24,507 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:39:24,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:24 BoogieIcfgContainer [2023-11-19 07:39:24,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:24,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:24,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:24,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:24,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:22" (1/3) ... [2023-11-19 07:39:24,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970241f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:24, skipping insertion in model container [2023-11-19 07:39:24,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:23" (2/3) ... [2023-11-19 07:39:24,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970241f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:24, skipping insertion in model container [2023-11-19 07:39:24,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:24" (3/3) ... [2023-11-19 07:39:24,522 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-19 07:39:24,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:24,544 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:39:24,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:24,603 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@158d3da2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:24,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:39:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 07:39:24,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:24,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:39:24,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:24,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2023-11-19 07:39:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109680588] [2023-11-19 07:39:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:24,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:39:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:24,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:39:24,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 07:39:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:24,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-19 07:39:24,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:25,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:39:25,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:39:25,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109680588] [2023-11-19 07:39:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109680588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965206421] [2023-11-19 07:39:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:25,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:39:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:25,536 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:25,658 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2023-11-19 07:39:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:25,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 07:39:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:25,669 INFO L225 Difference]: With dead ends: 19 [2023-11-19 07:39:25,670 INFO L226 Difference]: Without dead ends: 10 [2023-11-19 07:39:25,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:25,677 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:25,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-19 07:39:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-11-19 07:39:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-19 07:39:25,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2023-11-19 07:39:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:25,714 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-19 07:39:25,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-19 07:39:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 07:39:25,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:25,715 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:25,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:25,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:39:25,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:25,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2023-11-19 07:39:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336412927] [2023-11-19 07:39:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:25,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:39:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:25,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:39:25,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 07:39:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:26,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-19 07:39:26,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:28,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:31,593 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (= ((_ extract 7 0) (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|)))))))))))))))) (_ bv1 32))))))) (_ bv0 8))) (let ((.cse6 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse8 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse5 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse12 (= |c_ULTIMATE.start_main_~input_37~0#1| (_ bv0 8)))) (let ((.cse1 (= |c_ULTIMATE.start_main_~input_38~0#1| (_ bv0 8))) (.cse2 (or (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse13 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse5 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse5))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse13) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse14 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse5 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse5))) (_ bv16 32))))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse14) (_ bv0 32)) (not (= (bvand (bvor .cse6 (bvashr (bvor .cse14 .cse8) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)))))) .cse12)) (.cse3 (not .cse12))) (and (or .cse1 (and .cse2 (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse4 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse5))) .cse5))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse4) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse4) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse7 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse5))) .cse5))) (_ bv16 32))))) (or (not (= (bvand (bvor .cse6 (bvashr (bvor .cse7 .cse8) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse7) (_ bv0 32))))))))) (or (not .cse1) (and .cse2 (or .cse3 (let ((.cse10 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse5))) .cse5))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse9 (bvor .cse10 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse6 (bvashr (bvor .cse9 .cse8) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand .cse9 |c_ULTIMATE.start_main_~msb_SORT_4~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse11 (bvor .cse10 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse11 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand .cse11 |c_ULTIMATE.start_main_~msb_SORT_4~0#1|))))))))))))))) is different from false [2023-11-19 07:39:35,483 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|)) (.cse3 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse5 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse2 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|))) (let ((.cse10 (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse20 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse2))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse20) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse20) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse21 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse2))) (_ bv16 32))))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse21) (_ bv0 32)) (not (= (bvand (bvor .cse3 (bvashr (bvor .cse21 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|))))))) (.cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|))) (_ bv0 8))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse13)))) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse1 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse2))) .cse2))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse1) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse1) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse4 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse2))) .cse2))) (_ bv16 32))))) (or (not (= (bvand (bvor .cse3 (bvashr (bvor .cse4 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse4) (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (let ((.cse6 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|))))) (or (= .cse6 (_ bv0 8)) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse6)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|)))) .cse9))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|))))))))))))))))))))) (_ bv0 8)))))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (let ((.cse11 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|)))) (.cse12 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|))))) (or (= .cse11 (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse12)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse11))))))) .cse13)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|))))))))))))))))))) .cse7)) (_ bv0 8)) (= .cse12 (_ bv0 8)))))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|))) (_ bv0 8)))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse8))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (let ((.cse14 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|))))) (or (= .cse14 (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) .cse15))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse14))))))) .cse13)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))))))))))))))) .cse7))) (_ bv1 32)))) .cse7)) (_ bv0 8))))) .cse10) (or .cse0 (let ((.cse17 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse2)))))))))) .cse2))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse16 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) .cse17))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse16)) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse3 (bvashr (bvor .cse16 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse18 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) .cse17))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse18))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse18 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))))) (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) .cse15))))))))) .cse9))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|)))))))))))))))) (_ bv1 32)))))) (_ bv0 8))))))))))) is different from false [2023-11-19 07:39:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 07:39:35,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:39:35,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336412927] [2023-11-19 07:39:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336412927] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:35,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:39:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-19 07:39:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989300619] [2023-11-19 07:39:35,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:35,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:39:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:39:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:39:35,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2023-11-19 07:39:35,846 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:37,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|)) (.cse3 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse5 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse2 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|))) (let ((.cse16 (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv0 16))) (.cse10 (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse26 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse2))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse26) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse26) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse27 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse2))) (_ bv16 32))))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse27) (_ bv0 32)) (not (= (bvand (bvor .cse3 (bvashr (bvor .cse27 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|))))))) (.cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|))) (_ bv0 8))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse13)))) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (and (= |c_ULTIMATE.start_main_~var_32~0#1| (_ bv16 32)) (= |c_ULTIMATE.start_main_~var_28~0#1| (_ bv1 16)) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse1 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse2))) .cse2))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse1) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse1) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse4 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse2))) .cse2))) (_ bv16 32))))) (or (not (= (bvand (bvor .cse3 (bvashr (bvor .cse4 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse4) (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (let ((.cse6 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|))))) (or (= .cse6 (_ bv0 8)) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse6)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|)))) .cse9))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|))))))))))))))))))))) (_ bv0 8)))))) (= (bvadd |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (_ bv1 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~msb_SORT_4~0#1| (_ bv2147483648 32)) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (let ((.cse11 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|)))) (.cse12 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|))))) (or (= .cse11 (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse12)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse11))))))) .cse13)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|))))))))))))))))))) .cse7)) (_ bv0 8)) (= .cse12 (_ bv0 8)))))) (= (_ bv0 8) |c_ULTIMATE.start_main_~state_17~0#1|) (let ((.cse14 (exists ((|ULTIMATE.start_main_~var_40_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_40_arg_1~0#1|))) (_ bv1 32))))))) (or (and .cse14 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse15)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|)))))))))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= (_ bv0 8) .cse15)))))) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|)) .cse16) (and (exists ((|ULTIMATE.start_main_~var_39_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_39_arg_1~0#1|))))) (_ bv1 32))))) (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse17)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|))))))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= .cse17 (_ bv0 8))))))) (and .cse14 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse18 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|) (_ bv1 32)))) (.cse19 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse18)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse19)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= .cse18 (_ bv0 8))) (not (= (_ bv0 8) .cse19)))))))) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) .cse16 (= (_ bv17 32) |c_ULTIMATE.start_main_~var_27~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| (_ bv0 8)) (or (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|))) (_ bv0 8)))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse8))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (let ((.cse20 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|))))) (or (= .cse20 (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) .cse21))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse20))))))) .cse13)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))))))))))))))) .cse7))) (_ bv1 32)))) .cse7)) (_ bv0 8))))) .cse10) (or .cse0 (let ((.cse23 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse2)))))))))) .cse2))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse22 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) .cse23))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse22)) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse3 (bvashr (bvor .cse22 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse24 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) .cse23))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse24))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse24 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))))) (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) .cse21))))))))) .cse9))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|)))))))))))))))) (_ bv1 32)))))) (_ bv0 8))))))))))) is different from false [2023-11-19 07:39:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:41,753 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-11-19 07:39:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 07:39:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:41,755 INFO L225 Difference]: With dead ends: 15 [2023-11-19 07:39:41,755 INFO L226 Difference]: Without dead ends: 13 [2023-11-19 07:39:41,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=33, Invalid=66, Unknown=3, NotChecked=54, Total=156 [2023-11-19 07:39:41,759 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:41,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 19 Unchecked, 0.5s Time] [2023-11-19 07:39:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-19 07:39:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-11-19 07:39:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-11-19 07:39:41,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2023-11-19 07:39:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:41,773 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-11-19 07:39:41,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-11-19 07:39:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:39:41,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:41,774 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 07:39:41,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:39:41,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:41,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1020920393, now seen corresponding path program 2 times [2023-11-19 07:39:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:41,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886710929] [2023-11-19 07:39:41,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:39:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:39:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:41,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:39:41,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4b2e1a-8ae5-4a76-bebf-5db5199ef900/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-19 07:39:42,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:39:42,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:39:42,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-19 07:39:42,611 INFO L285 TraceCheckSpWp]: Computing forward predicates...